Various density light field image coding based on distortion minimization interpolation

In recent years, the light field (LF) as a new imaging modality has attracted wide interest. The large data volume of LF images poses great challenge to LF image coding, and the LF images captured by different devices show significant differences in angular domain. In this paper we propose a view prediction framework to handle LF image coding with various sampling density. All LF images are represented as view arrays. We first partition the views into reference view (RV) set and intermediate view (IV) set. The RVs are rearranged into a pseudo sequence and directly compressed by a video encoder. Other views are then predicted by the RVs. To exploit the four dimensional signal structure, we propose the linear approximation prior (LAP) to reveal the correlation among LF views and efficiently remove the LF data redundancy. Based on the LAP, a distortion minimization interpolation (DMI) method is used to predict IVs. To robustly handle the LF images with different sampling density, we propose an Iteratively Updating depth image based rendering (IU-DIBR) method to extend our DMI. Some auxiliary views are generated to cover the target region and then the DMI calculates reconstruction coefficients for the IVs. Different view partition patterns are also explored. Extensive experiments on different types LF images also valid the efficiency of the proposed method.     

Polynomial filtering for nonlinear stochastic systems with state‐ and disturbance‐dependent noises

This article is concerned with the polynomial filtering problem for a class of nonlinear stochastic systems governed by the Itô differential equation. The system under investigation involves polynomial nonlinearities, unknown‐but‐bounded disturbances, and state‐ and disturbance‐dependent noises ((x,d)‐dependent noises for short). By expanding the polynomial nonlinear functions in Taylor series around the state estimate, a new polynomial filter design method is developed with hope to reduce the conservatism of the existing results. In virtue of stochastic analysis and inequality technique, sufficient conditions in terms of parameter‐dependent linear matrix inequalities (PDLMIs) are derived to guarantee that the estimation error system is input‐to‐state stable in probability. Moreover, the desired polynomial matrix can be obtained by solving the PDLMIs via the sum‐of‐squares approach. The effectiveness and applicability of the proposed method are illustrated by two numerical examples with one concerning the permanent magnet synchronous motor.     

Incomplete analytic hierarchy process with minimum weighted ordinal violations

ABSTRACT

Incomplete pairwise comparison matrices offer a natural way of expressing preferences in decision-making processes. Although ordinal information is crucial, there is a bias in the literature: cardinal models dominate. Ordinal models usually yield nonunique solutions; therefore, an approach blending ordinal and cardinal information is needed. In this work, we consider two cascading problems: first, we compute ordinal preferences, maximizing an index that combines ordinal and cardinal information; then, we obtain a cardinal ranking by enforcing ordinal constraints. Notably, we provide a sufficient condition (that is likely to be satisfied in practical cases) for the first problem to admit a unique solution and we develop a provably polynomial-time algorithm to compute it. The effectiveness of the proposed method is analyzed and compared with respect to other approaches and criteria at the state of the art.     

机翼极限环颤振的CFD/CSD全隐式紧耦合方法

针对轴承振动实时状态监控的需要，从符号动力学角度提出了符号聚合近似与Lempel-ziv复杂度（SAX-LZC）融合的振动监控参数。首先，以Logistic映射和Duffing方程为对象，从理论角度验证了SAX-LZC对动力学结构表征的准确性，并验证了该指标的抗噪能力和计算效率；其次，将SAX-LZC指标与信息熵、样本熵、多分段Lempel-ziv复杂度等动力学参数性能进行了综合对比；最后，从实验角度对轴承早期微弱异常进行了监测，并对轴承典型故障进行了特征提取。理论研究结果表明，SAX-LZC具有动力学结构表征准确、抗噪能力好、计算高效简洁等优点，克服了常规动力学参数工程应用能力弱的问题。实验研究结果表明，SAX-LZC对早期微弱异常有准确的监测，对不同种类故障具有较好的区分度，弥补了时域和频域对轴承微弱故障表征能力不足的缺陷，是一种轴承振动实时状态监控与故障特征提取的有效参数。     

Computing approximate blocking probabilities for transparent waveband switching based WDM networks using hierarchical cross-connects

An analytical model is presented to study the dynamics of wavelength division multiplexing (WDM) networks with waveband switching (WBS). The reduced load approximation method is considered to compute approximated network blocking probabilities in WBS-based WDM networks. The analytical model considers the link blocking probability due to insufficient link capacity and an impact of the waveband granularity (G). The analytical model also considers the node blocking probability due to unavailability of a switch port at the wavelength cross connect (WXC) layer of an Hierarchical cross connect (HXC) switch node. The set of nonlinear equations is obtained with the link independence assumption and solved using repeated substitutions. The accuracy of the analytical model is examined by comparing with simulation results considering the random-fit algorithm for waveband and wavelength assignments in different network scenarios. Lightpaths are routed between source and destination (s-d) HXC switch nodes using shortest path first (SPF) routing. An impact of the switch parameter to limit the input and the output WXC switch ports of an HXC switching node is also being investigated using the analytical model as well as through simulation results.     

Replenishment policy for a purchase-to-order seller: a tradeoff between ordering cost and delay cost

We consider replenishment decisions on when and how many goods to purchase for a seller under a purchase-to-order mode where there is no inventory and the seller purchases goods to fulfil orders already placed. For each purchase, there is a constant ordering cost. For each order, delay cost will be incurred if it is not fulfilled timely. Generally, the more frequent the replenishment, the higher the ordering cost but the lower the delay cost. Consequently, there is a tradeoff between the ordering cost and the delay cost for the seller to make replenishment decisions minimising the total cost. In this paper, we study three cases of the problem and investigate both offline versions and online versions according to the seller's knowledge about information of future orders. For offline versions with perfect information, we either develop an optimal policy, or prove it is NP-hard and develop an approximation policy. For online versions without any information about future orders, from the perspective of competitive analysis we prove the lower bound of competitive ratio for any possible online policy and present a 10-competitive online policy for the general case and a 2-competitive online policy for each of two special cases.     

A deep neural network based classifier for brain tumor diagnosis

Classification process plays a key role in diagnosing brain tumors. Earlier research works are intended for identifying brain tumors using different classification techniques. However, the False Alarm Rates (FARs) of existing classification techniques are high. To improve the early-stage brain tumor diagnosis via classification the Weighted Correlation Feature Selection Based Iterative Bayesian Multivariate Deep Neural Learning (WCFS-IBMDNL) technique is proposed in this work. The WCFS-IBMDNL algorithm considers medical dataset for classifying the brain tumor diagnosis at an early stage. At first, the WCFS-IBMDNL technique performs Weighted Correlation-Based Feature Selection (WC-FS) by selecting subsets of medical features that are relevant for classification of brain tumors. After completing the feature selection process, the WCFS-IBMDNL technique uses Iterative Bayesian Multivariate Deep Neural Network (IBMDNN) classifier for reducing the misclassification error rate of brain tumor identification. The WCFS-IBMDNL technique was evaluated in JAVA language using Disease Diagnosis Rate (DDR), Disease Diagnosis Time (DDT), and FAR parameter through the epileptic seizure recognition dataset.     

一种改进的最小二乘回归子空间分割方法

最小二乘回归(LSR)算法是一种常见的子空间分割方法，由于LSR具有解析解，因此它的聚类性能较高。然而LSR算法是应用谱聚类方法聚类数据，谱聚类方法初始化聚类中心是随机的，会影响后面的聚类效果。针对这一问题，提出一种基于聚类中心局部密度和距离这2个特点的改进的LSR算法（LSR-DC）。在Extended Yale B数据集上进行实验，结果表明，该算法有较高的聚类精度，具有一定的鲁棒性，优于现有LSR等子空间分割方法。     

基于最小包容区域的球度误差评定方法

针对球度误差评定方法存在原理误差或模型误差,提出了一种符合最小包容区域定义的球度误差评定方法,即将几何搜索逼近算法与基于最小包容区域法的球度误差评定的几何结构和定义结合起来的准确评定方法。对仿真数据和其他文献中的数据进行了评定。所提方法与其他方法的评定结果表明,所提方法可以准确地找到最小包容区域球的球心并给出球度误差的精确解。     

Mixture ratio modeling of dynamic systems

Any knowledge extraction relies (possibly implicitly) on a hypothesis about the modelled-data dependence. The extracted knowledge ultimately serves to a decision-making (DM). DM always faces uncertainty and this makes probabilistic modelling adequate. The inspected black-box modeling deals with “universal” approximators of the relevant probabilistic model. Finite mixtures with components in the exponential family are often exploited. Their attractiveness stems from their flexibility, the cluster interpretability of components and the existence of algorithms for processing high-dimensional data streams. They are even used in dynamic cases with mutually dependent data records while regression and auto-regression mixture components serve to the dependence modeling. These dynamic models, however, mostly assume data-independent component weights, that is, memoryless transitions between dynamic mixture components. Such mixtures are not universal approximators of dynamic probabilistic models. Formally, this follows from the fact that the set of finite probabilistic mixtures is not closed with respect to the conditioning, which is the key estimation and predictive operation. The paper overcomes this drawback by using ratios of finite mixtures as universally approximating dynamic parametric models. The paper motivates them, elaborates their approximate Bayesian recursive estimation and reveals their application potential.